An Algorithm to Construct Greedy Drawings of Triangulations
نویسندگان
چکیده
منابع مشابه
An Algorithm to Construct Greedy Drawings of Triangulations
We show an algorithm to construct a greedy drawing of every given triangulation. The algorithm relies on two main results. First, we show how to construct greedy drawings of a fairly simple class of graphs, called triangulated binary cactuses. Second, we show that every triangulation can be spanned by a triangulated binary cactus. Further, we discuss how to extend our techniques in order to pro...
متن کاملA Greedy Algorithm to Construct L1 Graph with Ranked Dictionary
L1 graph is an effective way to represent data samples in many graph-oriented machine learning applications. Its original construction algorithm is nonparametric, and the graphs it generates may have high sparsity. Meanwhile, the construction algorithm also requires many iterative convex optimization calculations and is very time-consuming. Such characteristics would severely limit the applicat...
متن کاملQuasi - Greedy Triangulations Approximating
This paper settles the following two longstanding open problems: 1. What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? 2. Is there a polynomial time algorithm that always produces a triangulation whose length is within a constant factor from the minimum? The answer to the rst question is that the known (p n) lower bound is tight. The second quest...
متن کاملEuclidean Greedy Drawings of Trees
Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each sourcedestination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of Euclidean greedy embeddings in R is known for certain graph classes such as 3-connected planar graphs. We compl...
متن کاملCounting and enumerating pseudo-triangulations with the greedy flip algorithm∗
This paper studies pseudo-triangulations for a given point set in the plane. Pseudo-triangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as they have exactly inner angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties of pseudo-trian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2010
ISSN: 1526-1719
DOI: 10.7155/jgaa.00197